ScaffoldScaffolder: solving contig orientation via bidirected to directed graph reduction
نویسندگان
چکیده
منابع مشابه
Eigen-solving via reduction to DPR1 matrices
Highly effective polynomial root-finders have been recently designed based on eigen-solving for DPR1 (that is diagonal + rankone) matrices. We extend these algorithms to eigen-solving for the general matrix by reducing the problem to the case of the DPR1 input via intermediate transition to a TPR1 (that is triangular + rank-one) matrix. Our transforms use substantially fewer arithmetic operatio...
متن کاملThe Transitive Reduction of a Directed Graph
We consider economical representations for the path information in a directed graph. A directed graph G is said to be a transitive reduction of the directed graph G provided that (i) G has a directed path from vertex u to vertex v if and only if G has a directed path from vertex u to vertex v, and (ii) there is no graph with fewer arcs than G satisfying condition (i). Though directed graphs wit...
متن کاملDirected prime graph of non-commutative ring
Prime graph of a ring R is a graph whose vertex set is the whole set R any any two elements $x$ and $y$ of $R$ are adjacent in the graph if and only if $xRy = 0$ or $yRx = 0$. Prime graph of a ring is denoted by $PG(R)$. Directed prime graphs for non-commutative rings and connectivity in the graph are studied in the present paper. The diameter and girth of this graph are also studied in the pa...
متن کاملOn degree sequences of undirected, directed, and bidirected graphs
Bidirected graphs generalize directed and undirected graphs in that edges are oriented locally at every node. The natural notion of the degree of a node that takes into account (local) orientations is that of net-degree. In this paper, we extend the following four topics from (un)directed graphs to bidirected graphs: – Erdős–Gallai-type results: characterization of net-degree sequences, – Havel...
متن کاملSafe and Complete Contig Assembly Via Omnitigs
Contig assembly is the first stage that most assemblers solve when reconstructing a genome from a set of reads. Its output consists of contigs – a set of strings that are promised to appear in any genome that could have generated the reads. From the introduction of contigs 20 years ago, assemblers have tried to obtain longer and longer contigs, but the following question remains: given a genome...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2015
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/btv548